Harary index and some Hamiltonian properties of graphs
نویسندگان
چکیده
منابع مشابه
Harary index of product graphs
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, the exact formulae for the Harary indices of tensor product G × Km0,m1,...,mr−1 and the strong product G⊠Km0,m1,...,mr−1 , whereKm0,m1,...,mr−1 is the complete multipartite graph with partite sets of sizes m0,m1, . . . ,mr−1 are obtained. Also upper bounds for th...
متن کاملAdditively weighted Harary index of some composite graphs
We introduce a modification of the Harary index where the contributions of vertex pairs are weighted by the sum of their degrees. After establishing basic mathematical properties of the new invariant, we proceed by finding the extremal graphs and investigating its behavior under several standard graph products.
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولdetermination of some physical and mechanical properties red bean
چکیده: در این تحقیق، برخی خواص فیزیکی و مکانیکی لوبیا قرمز به-صورت تابعی از محتوی رطوبت بررسی شد. نتایج نشان داد که رطوبت بر خواص فیزیکی لوبیا قرمز شامل طول، عرض، ضخامت، قطر متوسط هندسی، قطر متوسط حسابی، سطح تصویر شده، حجم، چگالی توده، تخلخل، وزن هزار دانه و زاویه ی استقرار استاتیکی در سطح احتمال 1 درصد اثر معنی داری دارد. به طوری که با افزایش رطوبت از 54/7 به 12 درصد بر پایه خشک طول، عرض، ضخام...
15 صفحه اولEnergy and Some Hamiltonian Properties of Graphs
We consider only finite undirected graphs without loops or multiple edges. Notation and terminology not defined here follow that in [2]. For a graph G = (V, E), n := |V |, e := |E|, and G := (V, E), where E := { xy : x ∈ V, y ∈ V, x = y, xy ∈ E }. For a bipartite graph GBPT = (X, Y ; E), GBPT := (X, Y ; E ), where E := { xy : x ∈ X, y ∈ Y, xy ∈ E }. The degree of vertex vi is denoted by di. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2015
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2015.06.010